Recursive MOESP Type Subspace Identification Algorithm

نویسندگان

  • Catarina J. M. Delgado
  • Paulo J. Lopes dos Santos
چکیده

In this paper two recursive algorithms, based on MOESP type subspace identification, are presented in two versions. The main idea was to show that we can represent subspace identification methods as sequences of least squares problems and implement them through sequences of modified Householder algorithms. Therefore, it is possible to develop iterative algorithms with most of the advantages of this kind of methods, and still improve the numerical efficiency, in order to deal with real-time applications and minimize the computational burden.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive subspace identification based on instrumental variable unconstrained quadratic optimization

The problem of the recursive formulation of the MOESP class of subspace identification algorithms is considered and two novel instrumental variable approaches are introduced. The first one leads to an RLS-like implementation, the second to a gradient type iteration. The relative merits of both approaches are analysed and discussed, while simulation results are used to compare their performance ...

متن کامل

Recursive subspace identification of linear and non-linear Wiener state-space models

The problem of MIMO recursive identiication is considered and analyzed within the framework of subspace-based state space system identiication (4SID). With respect to previous contributions to this area, in this paper the use of recent signal processing algorithms for the recursive update of the SVD is proposed. To accommodate for arbitrary correlation of the disturbances, an instrumental varia...

متن کامل

Convergence analysis of instrumental variable recursive subspace identification algorithms

The convergence properties of a recently developed recursive subspace identification algorithm are investigated in this paper. The algorithm operates on the basis of an extended instrumental variable (EIV) version of the propagator method for signal subspace estimation. It is proved that, under weak conditions on the input signal and the identified system, the considered MOESP class of recursiv...

متن کامل

Recursive Subspace Identification Algorithm using the Propagator Based Method

Subspace model identification (SMI) method is the effective method in identifying dynamic state space linear multivariable systems and it can be obtained directly from the input and output data. Basically, subspace identifications are based on algorithms from numerical algebras which are the QR decomposition and Singular Value Decomposition (SVD). In industrial applications, it is essential to ...

متن کامل

Subspace closed loop identification using the integration of MOESP and N4SID methods

Linear identification of time invariant systems operating in closed loop is of special interest for a large number of engineering applications. There are different techniques and methods to carry out this type of identification. For example, modifying the N4SID method, one can derive a closed loop subspace identification method. The same can be done using the MOESP method. Based on them, the MO...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004